(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
U11(tt, M, N) → U12(tt, activate(M), activate(N))
U12(tt, M, N) → s(plus(activate(N), activate(M)))
plus(N, 0) → N
plus(N, s(M)) → U11(tt, M, N)
activate(X) → X
Rewrite Strategy: FULL
(1) RenamingProof (EQUIVALENT transformation)
Renamed function symbols to avoid clashes with predefined symbol.
(2) Obligation:
Runtime Complexity Relative TRS:
The TRS R consists of the following rules:
U11(tt, M, N) → U12(tt, activate(M), activate(N))
U12(tt, M, N) → s(plus(activate(N), activate(M)))
plus(N, 0') → N
plus(N, s(M)) → U11(tt, M, N)
activate(X) → X
S is empty.
Rewrite Strategy: FULL
(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)
Infered types.
(4) Obligation:
TRS:
Rules:
U11(tt, M, N) → U12(tt, activate(M), activate(N))
U12(tt, M, N) → s(plus(activate(N), activate(M)))
plus(N, 0') → N
plus(N, s(M)) → U11(tt, M, N)
activate(X) → X
Types:
U11 :: tt → s:0' → s:0' → s:0'
tt :: tt
U12 :: tt → s:0' → s:0' → s:0'
activate :: s:0' → s:0'
s :: s:0' → s:0'
plus :: s:0' → s:0' → s:0'
0' :: s:0'
hole_s:0'1_0 :: s:0'
hole_tt2_0 :: tt
gen_s:0'3_0 :: Nat → s:0'
(5) OrderProof (LOWER BOUND(ID) transformation)
Heuristically decided to analyse the following defined symbols:
plus
(6) Obligation:
TRS:
Rules:
U11(
tt,
M,
N) →
U12(
tt,
activate(
M),
activate(
N))
U12(
tt,
M,
N) →
s(
plus(
activate(
N),
activate(
M)))
plus(
N,
0') →
Nplus(
N,
s(
M)) →
U11(
tt,
M,
N)
activate(
X) →
XTypes:
U11 :: tt → s:0' → s:0' → s:0'
tt :: tt
U12 :: tt → s:0' → s:0' → s:0'
activate :: s:0' → s:0'
s :: s:0' → s:0'
plus :: s:0' → s:0' → s:0'
0' :: s:0'
hole_s:0'1_0 :: s:0'
hole_tt2_0 :: tt
gen_s:0'3_0 :: Nat → s:0'
Generator Equations:
gen_s:0'3_0(0) ⇔ 0'
gen_s:0'3_0(+(x, 1)) ⇔ s(gen_s:0'3_0(x))
The following defined symbols remain to be analysed:
plus
(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)
Proved the following rewrite lemma:
plus(
gen_s:0'3_0(
a),
gen_s:0'3_0(
n5_0)) →
gen_s:0'3_0(
+(
n5_0,
a)), rt ∈ Ω(1 + n5
0)
Induction Base:
plus(gen_s:0'3_0(a), gen_s:0'3_0(0)) →RΩ(1)
gen_s:0'3_0(a)
Induction Step:
plus(gen_s:0'3_0(a), gen_s:0'3_0(+(n5_0, 1))) →RΩ(1)
U11(tt, gen_s:0'3_0(n5_0), gen_s:0'3_0(a)) →RΩ(1)
U12(tt, activate(gen_s:0'3_0(n5_0)), activate(gen_s:0'3_0(a))) →RΩ(1)
U12(tt, gen_s:0'3_0(n5_0), activate(gen_s:0'3_0(a))) →RΩ(1)
U12(tt, gen_s:0'3_0(n5_0), gen_s:0'3_0(a)) →RΩ(1)
s(plus(activate(gen_s:0'3_0(a)), activate(gen_s:0'3_0(n5_0)))) →RΩ(1)
s(plus(gen_s:0'3_0(a), activate(gen_s:0'3_0(n5_0)))) →RΩ(1)
s(plus(gen_s:0'3_0(a), gen_s:0'3_0(n5_0))) →IH
s(gen_s:0'3_0(+(a, c6_0)))
We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).
(8) Complex Obligation (BEST)
(9) Obligation:
TRS:
Rules:
U11(
tt,
M,
N) →
U12(
tt,
activate(
M),
activate(
N))
U12(
tt,
M,
N) →
s(
plus(
activate(
N),
activate(
M)))
plus(
N,
0') →
Nplus(
N,
s(
M)) →
U11(
tt,
M,
N)
activate(
X) →
XTypes:
U11 :: tt → s:0' → s:0' → s:0'
tt :: tt
U12 :: tt → s:0' → s:0' → s:0'
activate :: s:0' → s:0'
s :: s:0' → s:0'
plus :: s:0' → s:0' → s:0'
0' :: s:0'
hole_s:0'1_0 :: s:0'
hole_tt2_0 :: tt
gen_s:0'3_0 :: Nat → s:0'
Lemmas:
plus(gen_s:0'3_0(a), gen_s:0'3_0(n5_0)) → gen_s:0'3_0(+(n5_0, a)), rt ∈ Ω(1 + n50)
Generator Equations:
gen_s:0'3_0(0) ⇔ 0'
gen_s:0'3_0(+(x, 1)) ⇔ s(gen_s:0'3_0(x))
No more defined symbols left to analyse.
(10) LowerBoundsProof (EQUIVALENT transformation)
The lowerbound Ω(n1) was proven with the following lemma:
plus(gen_s:0'3_0(a), gen_s:0'3_0(n5_0)) → gen_s:0'3_0(+(n5_0, a)), rt ∈ Ω(1 + n50)
(11) BOUNDS(n^1, INF)
(12) Obligation:
TRS:
Rules:
U11(
tt,
M,
N) →
U12(
tt,
activate(
M),
activate(
N))
U12(
tt,
M,
N) →
s(
plus(
activate(
N),
activate(
M)))
plus(
N,
0') →
Nplus(
N,
s(
M)) →
U11(
tt,
M,
N)
activate(
X) →
XTypes:
U11 :: tt → s:0' → s:0' → s:0'
tt :: tt
U12 :: tt → s:0' → s:0' → s:0'
activate :: s:0' → s:0'
s :: s:0' → s:0'
plus :: s:0' → s:0' → s:0'
0' :: s:0'
hole_s:0'1_0 :: s:0'
hole_tt2_0 :: tt
gen_s:0'3_0 :: Nat → s:0'
Lemmas:
plus(gen_s:0'3_0(a), gen_s:0'3_0(n5_0)) → gen_s:0'3_0(+(n5_0, a)), rt ∈ Ω(1 + n50)
Generator Equations:
gen_s:0'3_0(0) ⇔ 0'
gen_s:0'3_0(+(x, 1)) ⇔ s(gen_s:0'3_0(x))
No more defined symbols left to analyse.
(13) LowerBoundsProof (EQUIVALENT transformation)
The lowerbound Ω(n1) was proven with the following lemma:
plus(gen_s:0'3_0(a), gen_s:0'3_0(n5_0)) → gen_s:0'3_0(+(n5_0, a)), rt ∈ Ω(1 + n50)
(14) BOUNDS(n^1, INF)